Efficient Query Processing for Scalable Web Search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Nested Optional Join for Efficient Semantic Web Query Processing

Increasing amount of RDF data on the Web drives the need for its efficient and effective management. In this light, numerous researchers have proposed to use RDBMSs to store and query RDF annotations using the SQL and SPARQL query languages. The first few attempts at SPARQL-to-SQL translation revealed non-trivial challenges related to correctness and efficiency of such translation in the presen...

متن کامل

Query Segmentation for Web Search

This paper describes a query segmentation method for search engines supporting inverse lookup of words and phrases. Data mining in query logs and document corpora is used to produce segment candidates and compute connexity measures. Candidates are considered in context of the whole query, and a list of the most likely segmentations is generated, with each segment attributed with a connexity val...

متن کامل

Scalable Query Assistance for Search Engines

We present a novel algorithm that computes related words to a query by analysing the subset of hit documents w.r.t. the whole document collection .

متن کامل

Scalable Continuous Query System for Web Databases

Continuous Queries (CQ) help users to retrieve results as soon as they become available. The CQ keeps track of two important events. If there is any change in the source information, it immediately notifies the user about that particular change. Secondly, it also keeps track of the timer-based events, in case information is required after a fixed period of time. Existing techniques such as Open...

متن کامل

Scalable query result caching for web applications

The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it faces the challenge of maintaining a high cache hit rate while efficiently ensuring cache consistency as the database is updated. In this paper we introduce Ferdinand, the first proxy-based cooperative query result cache...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations and Trends® in Information Retrieval

سال: 2018

ISSN: 1554-0669,1554-0677

DOI: 10.1561/1500000057